Enriching Non-Parametric Bidirectional Search Algorithms
نویسندگان
چکیده
منابع مشابه
Experimental Evaluation of Parametric Search Algorithms
This paper provides an experimental report on implementation of parametric search algorithms. The algorithms are due to Matoušek and Cole et al. and answer the following questions about an arrangement of n lines: (a) compute a tangent to the k-level with a given direction d; (b) compute a tangent to the klevel through a given point p; and (c) compute the k-th vertex in the arrangement. The impl...
متن کاملNon - Linear Algorithms for Parametric Markov Programming
General idea of nonlinear correcting factors that was successfully applied to accelerate and derive algorithms for many linear and nonlinear problems is used to develop several efficient procedures for solving linear systems of equations based on the Jacobi algorithm. Results of the theoretical study and extensive computer experiments for stochastic matrices are presented and analyzed to determ...
متن کاملOptimal Parametric Search Algorithms in Trees I: Tree Partitioning
Linear-time algorithms are presented for partitioning a tree with weights on the vertices by removing k edges so as to either minimize the maximum weight component or maximize the minimum-weight component.
متن کاملExternal Memory Bidirectional Search
This paper studies external memory bidirectional search. That is, how bidirectional search algorithms can run using external memory such as hard drives or solid state drives. While external memory algorithms have been broadly studied in unidirectional search, they have not been studied in the context of bidirectional search. We show that the primary bottleneck in bidirectional search is the que...
متن کاملSingle-Frontier Bidirectional Search
We introduce a new bidirectional search algorithm, SingleFrontier Bidirectional Search (SFBDS). Unlike traditional BDS which keeps two frontiers, SFBDS uses a single frontier. At a particular node we can decide to search from start to goal or from goal to start, choosing the direction with the highest potential for minimizing the total work done. We provide theoretical analysis that explains wh...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the AAAI Conference on Artificial Intelligence
سال: 2019
ISSN: 2374-3468,2159-5399
DOI: 10.1609/aaai.v33i01.33012379